Joint Graph Learning and Matching for Semantic Feature Correspondence

نویسندگان

چکیده

In recent years, powered by the learned discriminative representation via graph neural network (GNN) models, deep matching methods have made great progresses in task of semantic features. However, these usually rely on heuristically generated patterns, which may introduce unreliable relationships to hurt performance. this paper, we propose a joint learning and network, named GLAM, explore reliable structures for boosting matching. GLAM adopts pure attention-based framework both Specifically, it employs two types attention mechanisms, self-attention cross-attention task. The discovers between features further update feature representations over learnt structures; computes cross-graph correlations sets be matched reconstruction. Moreover, final solution is directly derived from output layer, without employing specific decision module. proposed method evaluated three popular visual benchmarks (Pascal VOC, Willow Object SPair-71k), outperforms previous state-of-the-art all benchmarks. Furthermore, patterns our model are validated able remarkably enhance replacing their handcrafted with ones.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Feature Correspondence Via Graph Matching: Models and Global Optimization

Abstract. In this paper we present a new approach for establishing correspondences between sparse image features related by an unknown non-rigid mapping and corrupted by clutter and occlusion, such as points extracted from a pair of images containing a human figure in distinct poses. We formulate this matching task as an energy minimization problem by defining a complex objective function of th...

متن کامل

New Feature Correspondence Method using Bayesian Graph Matching Algorithm

In this paper, we propose a new approach for establishing the correspondence between local invariant features using Bayesian graph matching algorithm. First, we will discuss various local invariant feature detectors and descriptors for scale and affine transformation and illumination changes. Second, we propose an efficient features corresponding method using local invariant features and new gr...

متن کامل

Joint Feature Distributions for Image Correspondence

We develop a probabilistic framework for feature based multi-image matching that explicitly models the joint distribution of corresponding feature positions across several images. Conditioning this distribution on feature positions in some of the images gives welllocalized distributions for their correspondents in the others, which directly guide the correspondence search. This general framewor...

متن کامل

Joint Semantic Relevance Learning with Text Data and Graph Knowledge

Inferring semantic relevance among entities (e.g., entries of Wikipedia) is important and challenging. According to the information resources, the inference can be categorized into learning with either raw text data, or labeled text data (e.g., wiki page), or graph knowledge (e.g, WordNet). Although graph knowledge tends to be more reliable, text data is much less costly and offers a better cov...

متن کامل

Fast and scalable approximate spectral graph matching for correspondence problems

Establishing consistent correspondences between two sets of features is a fundamental problem in computer vision. This problem can be well formulated as graph matching in which nodes and edges represent feature points and pairwise relationships between feature points, respectively. Spectral matching [19] is the state-of-the-art eigenvector-based method for graph matching. The spectral matching ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Pattern Recognition

سال: 2023

ISSN: ['1873-5142', '0031-3203']

DOI: https://doi.org/10.1016/j.patcog.2022.109059